Space Splitting and Merging Technique for Online 3-D Bin Packing

This paper introduces a novel method for online 3-D bin packing, which is strongly NP-hard problem, based on space splitting and merging technique. In this scenario, the incoming box unknown must be immediately packed. The problem has many applications in industries that use manipulators to automate packing process. main idea of approach divide into spaces. These spaces are then categorized one two types data structures: secondary structures. Each node structure holds information can used fit new box. cannot place search algorithm these structures reduces required effort simplifies organizing editing structure. experimental results demonstrate proposed achieve packed volume ratio up 83% case multiple bins being used. position placed found within milliseconds.